Deciding Task Schedules for Temporal Planning via Auctions
نویسندگان
چکیده
We present an auction-based approach to allocate tasks that have complex time constraints and interdependencies to a group of cooperative agents. The approach combines the advantages of planning and scheduling with the ability to make distributed decisions. We focus on methods for modeling and evaluating the decisions an agent must make when deciding how to schedule tasks. In particular, we discuss how to specify task schedules when requesting quotes from other agents. The way tasks are scheduled affects the number and types of bids received, and therefore the quality of the solutions that can be produced.
منابع مشابه
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
Integrated modeling of temporal and logical constraints is important for solving real-life planning and scheduling problems. Logical constrains extend the temporal formalism by reasoning about alternative activities in plans/schedules. Temporal Networks with Alternatives (TNA) were proposed to model alternative and parallel processes, however the problem of deciding which activities can be cons...
متن کاملReachability Properties in Distributed Negotiation Negotiation Can be as Hard as Planning: Deciding Reachability Properties of Distributed Negotiation Schemes
Distributed negotiation schemes offer one approach to agreeing an allocation of resources among a set of individual agents. Such schemes attempt to agree a distribution via a sequence of locally agreed ‘deals’ – reallocations of resources among the agents – ending when the result satisfies some accepted criteria. Our aim in this article is to demonstrate that some natural decision questions ari...
متن کاملMulti-Robot Auctions for Allocation of Tasks with Temporal Constraints
We propose an auction algorithm to allocate tasks that have temporal constraints to cooperative robots. Temporal constraints are expressed as time windows, within which a task must be executed. There are no restrictions on the time windows, which are allowed to overlap. Robots model their temporal constraints using a simple temporal network, enabling them to maintain consistent schedules. When ...
متن کاملOn contiguous and non-contiguous parallel task scheduling
In this paper we study differences between contiguous and non-contiguous parallel task schedules. Parallel tasks can be executed on more than one processor simultaneously. In the contiguous schedules indices of the processors assigned to a task must be a sequence of consecutive numbers. In the non-contiguous schedules processor indices may be arbitrary. Nonpreemptive schedules are considered. G...
متن کاملEffects of Textually-Enhanced Reading Tasks and Strategic Pre-Task Planning on Learning English Passive Voice
In the realm of second language acquisition (SLA), task-based language teaching (TBLT) and input enhancement (IE) have been the focus of a great number of studies. However, the idea of investigating the effects of focus on form instruction through input-enhanced tasks along with pre-task planning time as one of the features of task-based language teaching has been rarely explored in the field o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006